133 research outputs found
Performance Analysis of Random Linear Network Coding in Two-Source Single-Relay Networks
This paper considers the multiple-access relay channel in a setting where two
source nodes transmit packets to a destination node, both directly and via a
relay node, over packet erasure channels. Intra-session network coding is used
at the source nodes and inter-session network coding is employed at the relay
node to combine the recovered source packets of both source nodes. In this
work, we investigate the performance of the network-coded system in terms of
the probability that the destination node will successfully recover the source
packets of the two source nodes. We build our analysis on fundamental
probability expressions for random matrices over finite fields and we derive
upper bounds on the system performance for the case of systematic and
non-systematic network coding. Simulation results show that the upper bounds
are very tight and accurately predict the decoding probability at the
destination node. Our analysis also exposes the clear benefits of systematic
network coding at the source nodes compared to non-systematic transmission.Comment: Proc. ICC 2015, Workshop on Cooperative and Cognitive Mobile Networks
(CoCoNet), to appea
Rethinking the Intercept Probability of Random Linear Network Coding
This letter considers a network comprising a transmitter, which employs
random linear network coding to encode a message, a legitimate receiver, which
can recover the message if it gathers a sufficient number of linearly
independent coded packets, and an eavesdropper. Closed-form expressions for the
probability of the eavesdropper intercepting enough coded packets to recover
the message are derived. Transmission with and without feedback is studied.
Furthermore, an optimization model that minimizes the intercept probability
under delay and reliability constraints is presented. Results validate the
proposed analysis and quantify the secrecy gain offered by a feedback link from
the legitimate receiver.Comment: IEEE Communications Letters, to appea
Improved bounds on the decoding failure probability of network coding over multi-source multi-relay networks
This letter considers a multi-source multi-relay network, in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it can recover the packets of all source nodes. The links between source-to-relay nodes and relay-to-destination nodes are modeled as packet erasure channels. Improved bounds on the probability of decoding failure are presented, which are markedly close to simulation results and notably better than previous bounds. Examples demonstrate the tightness and usefulness of the new bounds over the old bounds
Characterisation and performance analysis of random linear network coding for reliable and secure communication
In this thesis, we develop theoretical frameworks to characterize the performance of Random Linear Network Coding (RLNC), and propose novel communication schemes for the achievement of both reliability and security in wireless networks. In particular, (i) we present an analytical model to evaluate the performance of practical RLNC schemes suitable for low-complexity receivers, prioritized (i.e., layered) coding and multi-hop communications, (ii) investigate the performance of RLNC in relay assisted networks and propose a new cross-layer RLNC-aided cooperative scheme for reliable communication, (iii) characterize the secrecy feature of RLNC and propose a new physical-application layer security technique for the purpose of achieving security and reliability in multi-hope communications. At first, we investigate random block matrices and derive mathematical expressions for the enumeration of full-rank matrices that contain blocks of random entries arranged in a diagonal, lower-triangular or tri-diagonal structure. The derived expressions are then used to model the probability that a receiver will successfully decode a source message or layers of a service, when RLNC based on non-overlapping, expanding or sliding generations is employed. Moreover, the design parameters of these schemes allow to adjust the desired decoding performance. Next, we evaluate the performance of Random Linear Network Coded Cooperation (RLNCC) in relay assisted networks, and propose a cross-layer cooperative scheme which combines the emerging Non-Orthogonal Multiple Access (NOMA) technique and RLNCC. In this regard, we first consider the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node. Secondly, we consider a multi-source multi-relay network, in which relay nodes employ RLNC on source packets and generate coded packets. For each network, we build our analysis on fundamental probability expressions for random matrices over finite fields and we derive theoretical expressions of the probability that the destination node will successfully decode the source packets. Finally, we consider a multi-relay network comprising of two groups of source nodes, where each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed whereby packets at the relay nodes are combined using two methods; packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using RLNC. An analytical framework that characterizes the performance of the proposed scheme is developed, and benchmarked against a counterpart scheme that is based on orthogonal multiple access. Finally, we quantify and characterize the intrinsic security feature of RLNC and design a joint physical-application layer security technique. For this purpose, we first consider a network comprising a transmitter, which employs RLNC to encode a message, a legitimate receiver, and a passive eavesdropper. Closed-form analytical expressions are derived to evaluate the intercept probability of RLNC, and a resource allocation model is presented to further minimize the intercept probability. Afterward, we propose a joint RLNC and opportunistic relaying scheme in a multi relay network to transmit confi- dential data to a destination in the presence of an eavesdropper. Four relay selection protocols are studied covering a range of network capabilities, such as the availability of the eavesdropper’s channel state information or the possibility to pair the selected relay with a jammer node that intentionally generates interference. For each case, expressions of the probability that a coded packet will not be decoded by a receiver, which can be either the destination or the eavesdropper, are derived. Based on those expressions, a framework is developed that characterizes the probability of the eavesdropper intercepting a sufficient number of coded packets and partially or fully decoding the confidential data. We observe that the field size over which RLNC is performed at the application layer as well as the adopted modulation and coding scheme at the physical layer can be modified to fine-tune the trade-off between security and reliability
An Optimal k Nearest Neighbours Ensemble for Classification Based on Extended Neighbourhood Rule with Features subspace
To minimize the effect of outliers, kNN ensembles identify a set of closest
observations to a new sample point to estimate its unknown class by using
majority voting in the labels of the training instances in the neighbourhood.
Ordinary kNN based procedures determine k closest training observations in the
neighbourhood region (enclosed by a sphere) by using a distance formula. The k
nearest neighbours procedure may not work in a situation where sample points in
the test data follow the pattern of the nearest observations that lie on a
certain path not contained in the given sphere of nearest neighbours.
Furthermore, these methods combine hundreds of base kNN learners and many of
them might have high classification errors thereby resulting in poor ensembles.
To overcome these problems, an optimal extended neighbourhood rule based
ensemble is proposed where the neighbours are determined in k steps. It starts
from the first nearest sample point to the unseen observation. The second
nearest data point is identified that is closest to the previously selected
data point. This process is continued until the required number of the k
observations are obtained. Each base model in the ensemble is constructed on a
bootstrap sample in conjunction with a random subset of features. After
building a sufficiently large number of base models, the optimal models are
then selected based on their performance on out-of-bag (OOB) data.Comment: 12 page
Opportunistic relaying and random linear network coding for secure and reliable communication
Opportunistic relaying has the potential to achieve full diversity gain, while random linear network coding (RLNC) can reduce latency and energy consumption. In recent years, there has been a growing interest in the integration of both schemes into wireless networks in order to reap their benefits, while considering security concerns. This paper considers a multi-relay network, where relay nodes employ RLNC to encode confidential data and transmit coded packets to a destination in the presence of an eavesdropper. Four relay selection protocols are studied covering a range of network capabilities, such as the availability of the eavesdropper's channel state information or the possibility to pair the selected relay with a node that intentionally generates interference. For each case, expressions for the probability that a coded packet will not be recovered by a receiver, which can be either the destination or the eavesdropper, are derived. Based on those expressions, a framework is developed that characterizes the probability of the eavesdropper intercepting a sufficient number of coded packets and partially or fully recovering the confidential data. Simulation results confirm the validity and accuracy of the theoretical framework and unveil the security-reliability trade-offs attained by each RLNC-enabled relay selection protocol
Non-orthogonal multiple access combined with random linear network coded cooperation
This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed, whereby packets at the relay nodes are combined using two methods; packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using random linear network coding. An analytical framework that characterizes the performance of the proposed scheme is developed, compared to simulation results and benchmarked against a counterpart scheme that is based on orthogonal multiple access
Spontaneous intracranial hypotension; three case reports with similar clinical manifestations, treated successfully using different management techniques.
Spontaneous Intracranial hypotension (SIH) is a rare neurological disorder, characterized by orthostatic headaches. Due to the complicity of its diagnosis and lack of awareness amongst physicians, SIH remains an under-diagnosed disease and its true prevalence remains unknown. It is a reversible condition, if diagnosed early. Delay in diagnosis can result in life threatening complications.Case Reports:We present a case series of three patients who presented with typical symptoms of SIH. But management course of each patient varied. The first patient responded well to the EBP (epidural blood patch) while the second improved with conventional symptomatic treatment. The third patient needed a surgical intervention for complication developed due to SIH. This case series hence covers a variety of treatment options for patients with SIH.Conclusion:SIH is an emerging challenge for neurologists worldwide. Awareness amongst physicians regarding this disease along with a high level of suspicion and good history skills will allow early diagnosis of the disease and prevent delay in treatment and hence complications
Random linear network coding based physical layer security for relay-aided device-to-device communication
We investigate physical layer security design, which employs random linear network coding with opportunistic relaying and jamming to exploit the secrecy benefit of both source and relay transmissions. The proposed scheme requires the source to transmit artificial noise along with a confidential message. Moreover, in order to further improve the dynamical behaviour of the network against an eavesdropping attack, aggregated power controlled transmissions with optimal power allocation strategy is considered. The network security is accurately characterised by the probability that the eavesdropper will manage to intercept a sufficient number of coded packets to partially or fully recover the confidential message
Network-coded NOMA with antenna selection for the support of two heterogeneous groups of users
The combination of Non-Orthogonal Multiple Access (NOMA) and Transmit Antenna Selection (TAS) techniques
has recently attracted significant attention due to the low cost,
low complexity and high diversity gains. Meanwhile, Random
Linear Coding (RLC) is considered to be a promising technique
for achieving high reliability and low latency in multicast
communications. In this paper, we consider a downlink system
with a multi-antenna base station and two multicast groups of
single-antenna users, where one group can afford to be served
opportunistically, while the other group consists of comparatively
low power devices with limited processing capabilities that have
strict Quality of Service (QoS) requirements. In order to boost
reliability and satisfy the QoS requirements of the multicast
groups, we propose a cross-layer framework including NOMAbased TAS at the physical layer and RLC at the application
layer. In particular, two low complexity TAS protocols for NOMA
are studied in order to exploit the diversity gain and meet the
QoS requirements. In addition, RLC analysis aims to facilitate
heterogeneous users, such that, sliding window based sparse RLC
is employed for computational restricted users, and conventional
RLC is considered for others. Theoretical expressions that
characterize the performance of the proposed framework are
derived and verified through simulation results
- …